Tutte′s 3-Flow Conjecture and Short Cycle Covers
نویسندگان
چکیده
منابع مشابه
Flows, flow-pair covers and cycle double covers
In this paper, some earlier results by Fleischner [H. Fleischner, Bipartizing matchings and Sabidussi’s compatibility conjecture, DiscreteMath. 244 (2002) 77–82] about edge-disjoint bipartizingmatchings of a cubic graphwith a dominating circuit are generalized for graphs without the assumption of the existence of a dominating circuit and 3-regularity. A pair of integer flows (D, f1) and (D, f2)...
متن کاملComputing Cycle Covers without Short Cycles
A cycle cover of a graph is a spanning subgraph where each node is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. We call the decision problems whether a directed or undirected graph has a k-cycle cover k-DCC and k-UCC. Given a graph with edge weights one and two, Min-k-DCC and Min-k-UCC are the minimization problems of finding a k-cyc...
متن کاملTwo Approximation Algorithms for 3-Cycle Covers
A cycle cover of a directed graph is a collection of node disjoint cycles such that every node is part of exactly one cycle. A k-cycle cover is a cycle cover in which every cycle has length at least k. While deciding whether a directed graph has a 2-cycle cover is solvable in polynomial time, deciding whether it has a 3-cycle cover is already NP-complete. Given a directed graph with nonnegative...
متن کاملSCHUR COVERS and CARLITZ’S CONJECTURE
We use the classification of finite simple groups and covering theory in positive characteristic to solve Carlitz’s conjecture (1966). An exceptional polynomial f over a finite field Fq is a polynomial that is a permutation polynomial on infinitely many finite extensions of Fq. Carlitz’s conjecture says f must be of odd degree (if q is odd). Indeed, excluding characteristic 2 and 3, arithmetic ...
متن کاملShort Cycle Covers of Graphs with Minimum Degree Three
The Shortest Cycle Cover Conjecture asserts that the edges of every bridgeless graph with m edges can be covered by cycles of total length at most 7m/5 = 1.4m. We show that every bridgeless graph with minimum degree three that contains m edges has a cycle cover comprised of three cycles of total length at most 44m/27 ≈ 1.6296m; this extends a bound of Fan [J. Graph Theory 18 (1994), 131–141] fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1993
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1004